Automated Reasoning and Presentation Support for Formalizing Mathematics in Mizar

This paper presents a combination of several automated reasoning and proof presentation tools with the Mizar system for formalization of mathematics. The combination forms an online service called MizAR, similar to the SystemOnTPTP service for first-order automated reasoning. The main differences to SystemOnTPTP are the use of the Mizar language that is oriented towards human mathematicians (rather than the pure first-order logic used in SystemOnTPTP), and setting the service in the context of the large Mizar Mathematical Library of previous theorems,definitions, and proofs (rather than the isolated problems that are solved in SystemOnTPTP). These differences poses new challenges and new opportunities for automated reasoning and for proof presentation tools. This paper describes the overall structure of MizAR, and presents the automated reasoning systems and proof presentation tools that are combined to make MizAR a useful mathematical service.Comment: To appear in 10th International Conference on. Artificial Intelligence and Symbolic Computation AISC 201

New results on rewrite-based satisfiability procedures

Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T. If a sound and complete inference system for first-order logic is guaranteed to terminate on T-satisfiability problems, any theorem-proving strategy with that system and a fair search plan is a T-satisfiability procedure. We prove termination of a rewrite-based first-order engine on the theories of records, integer offsets, integer offsets modulo and lists. We give a modularity theorem stating sufficient conditions for termination on a combinations of theories, given termination on each. The above theories, as well as others, satisfy these conditions. We introduce several sets of benchmarks on these theories and their combinations, including both parametric synthetic benchmarks to test scalability, and real-world problems to test performances on huge sets of literals. We compare the rewrite-based theorem prover E with the validity checkers CVC and CVC Lite. Contrary to the folklore that a general-purpose prover cannot compete with reasoners with built-in theories, the experiments are overall favorable to the theorem prover, showing that not only the rewriting approach is elegant and conceptually simple, but has important practical implications.Comment: To appear in the ACM Transactions on Computational Logic, 49 page

Synthesis, in vitro antiproliferative activities, and Chk1 inhibitory properties of dipyrrolo[3,4-a:3,4-c]carbazole triones.

The syntheses of dipyrrolo[3,4-a:3,4-c]carbazole-1,4,6-triones and dipyrrolo[3,4-a:3,4-c]carbazole-3,4,6-triones are reported. These compounds can be considered as granulatimide analogues in which a maleimide replaces the imidazole moiety and a five-membered lactam ring replaces the upper maleimide. The Chk1 inhibitory properties of the more soluble compounds have been evaluated and their in vitro antiproliferative activities toward three tumor cell lines: murine leukemia L1210, and human colon carcinoma HT29 and HCT116. Due to their insolubility, the biological activities of the other compounds in this series could not be evaluated. All the tested compounds proved to be potent Chk1 inhibitor

The Use of Imatinib Mesylate as a Lifesaving Treatment of Chronic Myeloid Leukemia Relapse after Bone Marrow Transplantation

We describe the response of imatinib as lifesaving treatment of chronic myeloid leukemia (CML) relapse in seven patients who underwent allogeneic bone marrow transplantation (alloBMT) at our institution over a period of 4 years. Retrospective analysis of their medical records revealed that a mean age at transplant was 45.2 years. The median time to diagnosis was 7.4 years after transplant. At relapse, four, two, and one patients were classified as having hematologic, major molecular, and cytogenetic relapse, respectively. At imatinib initiation, five had CML in a chronic phase, while one patient was diagnosed as having accelerated phase and blast crisis. All these patients could be evaluated for the therapeutic efficacy. At a mean of follow-up of 1.9 years of therapy, all evaluable patients achieved major molecular response without compromising safety. Consistent with available data, our results indicate that imatinib is safe and effective treatment option for patients with relapse after BMT

Successful Pregnancy and Delivery in a Patient with Chronic Myeloid Leukemia while on Dasatinib Therapy

Here we report the case of an 18-year-old woman with chronic myeloid leukemia (CML) who became pregnant while undergoing treatment with dasatinib. Before pregnancy, she received imatinib mesylate therapy but could not tolerate the treatment. The regimen was then changed to dasatinib at a dose of 70 mg b.i.d. While she was in hematological remission and on dasatinib therapy, she became pregnant. The unplanned pregnancy was identified after the patient had experienced four weeks of amenorrhea. Because the patient elected to continue the pregnancy to term, dasatinib was stopped immediately. Meanwhile, CML hematological relapse occurred and then she was treated with interferon-α (IFN-α) (9 million IU/day) throughout the pregnancy without a complete hematological response. She successfully gave birth to a male baby at 33 weeks by cesarean section delivery with no sequelae or malformations. Although this experience is limited to a single patient, it provides a useful contribution for counselling patients inadvertently exposed to dasatinib during pregnancy

paraVerifier: An automatic framework for proving parameterized cache coherence protocols

Abstract. Parameterized verification of cache coherence protocols is an impor-tant but challenging research problem. We present in this paper our automatic framework paraVerifier to handle this problem: (1) it first discovers auxiliary in-variants and the corresponding causal relations between invariants and protocol rules from a small reference instance of the verified protocol; (2) the discovered invariants and causal relations can then be generalized into their parameterized form to automatically construct a formal proof to establish the correctness of the protocol. paraVerifier has been successfully applied to a number of benchmarks.

Two successful pregnancies in a woman with chronic myeloid leukemia exposed to nilotinib during the first trimester of her second pregnancy: case study

The occurrence of chronic myeloid leukemia in pregnancy is rare and its management poses a clinical challenge for physicians treating these patients. We report a 30-year-old woman with chronic myeloid leukemia who became pregnant twice successfully. Philadelphia-positive CML in its chronic phase was diagnosed at 16 weeks of her first gestation. At that time, she received no treatment throughout her pregnancy. At 38 weeks of gestation, a normal infant was delivered by cesarean section. At six weeks postpartum, the patient underwent imatinib mesylate therapy but she could not tolerate the treatment. The treatment was then changed to nilotinib at 400 mg orally b.i.d. Two years later, she became pregnant again while she was on nilotinib 200 mg b.i.d. The unplanned pregnancy was identified during her 7.4 weeks of gestation. Because the patient elected to continue her pregnancy, nilotinib was stopped immediately, and no further treatment was given until delivery. Neither obstetrical complications nor structural malformations in neonates in both pregnancies were observed. Both babies' growth and development have been normal. Although this experience is limited to a single patient, the success of this patient demonstrates that the management of chronic myeloid leukemia in pregnant women may be individualized based on the relative risks and benefits of the patient and fetus

BSP Functional Programming: Examples of a Cost Based Methodology

Abstract. Bulk-Synchronous Parallel ML (BSML) is a functional data-parallel language for the implementation of Bulk-Synchronous Parallel (BSP) algorithms. It makes an estimation of the execution time (cost) possible. This paper presents some general examples of BSML programs and a comparison of their predicted costs with the measured execution time on a parallel machine